On the Spanning Trees of Weighted Graphs
نویسندگان
چکیده
Given a weighted graph, let W 1 ; W 2 ; W 3 ; : : : denote the increasing sequence of all possible distinct spanning tree weights. Settling a conjecture due to Kano, we prove that every spanning tree of weight W 1 is at most k ? 1 edge swaps away from some spanning tree of weight W k. Three other conjectures posed by Kano are proven for two special classes of graphs. Finally, we consider the algorithmic complexity of generating a spanning tree of weight W k .
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملEnumerating spanning trees of graphs with an involution
As the extension of the previous work by Ciucu and the present authors (J. Combin. Theory Ser. A 112(2005) 105–116), this paper considers the problem of enumeration of spanning trees of weighted graphs with an involution which allows fixed points. We show that if G is a weighted graph with an involution, then the sum of weights of spanning trees of G can be expressed in terms of the product of ...
متن کاملRanking and ordering problems of spanning trees
Each spanning tree T of an undirected graph G = (V,E) is represented by a vertex in the tree graph ofG. Two of these ‘spanning tree’ vertices are connected by an edge if and only if the corresponding spanning trees are related by an edge swap. This definition can also be extended to undirected weighted graphs G = (V,E, w) and weighted spanning trees. A couple of questions have arisen regarding ...
متن کاملAlgorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
In this paper, we present algorithms for enumeration of spanning trees in undi-rected graphs, with and without weights. The algorithms use a search tree technique to construct a computation tree. The computation tree can be used to output all spanning trees by outputting only relative changes between spanning trees rather than the entire spanning trees themselves. Both the construction of the c...
متن کاملWeighted Spanning Trees on some Self-Similar Graphs
We compute the complexity of two infinite families of finite graphs: the Sierpiński graphs, which are finite approximations of the well-known Sierpiński gasket, and the Schreier graphs of the Hanoi Towers group H(3) acting on the rooted ternary tree. For both of them, we study the weighted generating functions of the spanning trees, associated with several natural labellings of the edge sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 12 شماره
صفحات -
تاریخ انتشار 1988